Longest cycles in k-connected graphs with given independence number
نویسندگان
چکیده
منابع مشابه
Longest cycles in k-connected graphs with given independence number
The Chvátal–Erdős Theorem states that every graph whose connectivity is at least its independence number has a spanning cycle. In 1976, Fouquet and Jolivet conjectured an extension: If G is an n-vertex k-connected graph with independence number a, and a ≥ k, then G has a cycle with length at least k(n+a−k) a . We prove this conjecture.
متن کاملHighly connected subgraphs of graphs with given independence number
Let G be a graph on n vertices with independence number α. What is the largest k-connected subgraph that G must contain? We prove that if n is sufficiently large (n ≥ αk + 1 will do), then G always contains a k-connected subgraph on at least n/α vertices. This is sharp, since G might be the disjoint union of α equally-sized cliques. For k ≥ 3 and α = 2, 3, we shall prove that the same result ho...
متن کاملIntersections of Longest Cycles in k-Connected Graphs
Let G be a connected graph, where k2. S. Smith conjectured that every two longest cycles of G have at least k vertices in common. In this note, we show that every two longest cycles meet in at least ck 3Â5 vertices, where cr0.2615. 1998 Academic Press In this note, we provide a lower bound on the number of vertices in the intersection of any two longest cycles in a k-connected graph (k2). This ...
متن کاملMaximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number
The Turán connected graph TCn,α is obtained from α cliques of size b αc or d αe by joining all cliques by an edge to one central vertex in one of the larger cliques. The graph TCn,α was shown recently by Bruyère and Mélot to maximise the number of independent sets among connected graphs of order n and independence number α. We prove a generalisation of this result by showing that TCn,α in fact ...
متن کاملON THE NUMBER OF CYCLES IN k–CONNECTED GRAPHS
We give estimations for the minimum number of cycles in three special subclasses of the class of k-connected graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2011
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.02.005